Groups, Algorithms and Programming (GAP) and the Nonabelian Tensor Square of Groups of Order 8q
نویسندگان
چکیده
منابع مشابه
commuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولAdvances in Computing the Nonabelian Tensor Square of Polycyclic Groups
The nonabelian tensor square G⊗G of the group G is the group generated by the symbols g ⊗ h, where g, h ∈ G, subject to the relations gg′ ⊗ h = (gg′ ⊗ h)(g ⊗ h) and g ⊗ hh′ = (g ⊗ h)(g ⊗ hh′) for all g, g, h, h′ ∈ G, where gg′ = gg′g−1 is conjugation on the left. Following the work of C. Miller [18], R. K. Dennis in [10] introduced the nonabelian tensor square which is a specialization of the m...
متن کاملon the relationship between different discourse markers and information-gap and reasoning-gap tasks, and the effectiveness of input enhancement type of instruction on students acquisition of discourse markers.
abstract tasks nowadays are at the center of attention in sla research. task types is one of the critical issues in this regard, their effectiveness and suitability to any particular context, their characteristics and the result they yield are among some of these issues. on the other hand, discourse markers (dms) have been very much investigated and their effectiveness in conveying the meaning...
15 صفحه اولCLASSIFYING FUZZY SUBGROUPS OF FINITE NONABELIAN GROUPS
In this paper a rst step in classifying the fuzzy subgroups of a nite nonabelian group is made. We develop a general method to count the number of distinct fuzzy subgroups of such groups. Explicit formulas are obtained in the particular case of dihedral groups.
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.1.19482